Перевод: со всех языков на русский

с русского на все языки

shortest path movement

См. также в других словарях:

  • Desire path — A typical desire line A desire path (also known as a desire line or social trail) is a path developed by erosion caused by footfall. The path usually represents the shortest or most easily navigated route between an origin and destination. The… …   Wikipedia

  • Hyperspace (science fiction) — Hyperspace is a fictional plot device sometimes used in science fiction. It is typically described as an alternate region of subspace co existing with our own universe which may be entered using an energy field or other device. Travel in… …   Wikipedia

  • Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… …   Wikipedia

  • Geodesic — [ great circle arcs.] In mathematics, a geodesic IPA|/ˌdʒiəˈdɛsɪk, ˈdisɪk/ [jee uh des ik, dee sik] is a generalization of the notion of a straight line to curved spaces . In presence of a metric, geodesics are defined to be (locally) the… …   Wikipedia

  • relativity — /rel euh tiv i tee/, n. 1. the state or fact of being relative. 2. Physics. a theory, formulated essentially by Albert Einstein, that all motion must be defined relative to a frame of reference and that space and time are relative, rather than… …   Universalium

  • Cul-de-sac — For other uses, see Cul de sac (disambiguation). Blind alley redirects here. For other uses, see Blind Alley (disambiguation). Dead End Street redirects here. For the song by The Kinks, see Dead End Street (song). A cul de sac in Sacramento,… …   Wikipedia

  • number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

  • Taxicab geometry — versus Euclidean distance: In taxicab geometry all three pictured lines (red, blue, and yellow) have the same length (12) for the same route. In Euclidean geometry, the green line has length 6×√2 ≈ 8.48, and is the unique shortest path …   Wikipedia

  • Routing in delay tolerant networking — concerns itself with theability to transport, or route, data from a source to adestination is a fundamental ability all communication networks musthave. Delay and disruption tolerant networks(DTNs), arecharacterized by their lack of connectivity …   Wikipedia

  • Desktop Tower Defense — in play Developer(s) Paul Preece Distributor(s) …   Wikipedia

  • Northampton, Massachusetts —   City   Northampton, Massachusetts Main Street …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»